Colour gamut mapping between small and large colour gamuts: Part I gamut compression
نویسندگان
چکیده
منابع مشابه
Cubical Gamut Mapping Colour Constancy
A new color constancy algorithm called Cubical Gamut Mapping (CGM) is introduced. CGM is computationally very simple, yet performs better than many currently known algorithms in terms of median illumination estimation error. Moreover, it can be tuned to minimize the maximum error. Being able to reduce the maximum error, possibly at the expense of increased median error, is an advantage over man...
متن کاملImprovements to Gamut Mapping Colour Constancy Algorithms
In his paper we introduce two improvements to the threedimensional gamut mapping approach to computational colour constancy. This approach consist of two separate parts. First the possible solutions are constrained. This part is dependent on the diagonal model of illumination change, which in turn, is a function of the camera sensors. In this work we propose a robust method for relaxing this re...
متن کاملEnhancing the SGCK Colour Gamut Mapping Algorithm
The SGCK gamut mapping algorithm suggested by CIE TC8-03 has been enhanced by introducing a two-step procedure. Firstly, SGCK is used for gamut mapping the image onto a convex hull representation of the reproduction gamut. The resulting image is then further mapped onto a more realistic representation of the reproduction gamut using hue-angle preserving minimum ∆E∗ ab clipping. Panel testing wi...
متن کاملA Multi-Resolution, Full-Colour Spatial Gamut Mapping Algorithm
A multi–resolution, full–colour spatial gamut mapping algorithm (GMA) is proposed in this paper. Its aim is to maintain as much of an original image’s overall, and in particular spatial, information as possible within the limits of a reproduction medium’s gamut. First, the original image is decomposed into different spatial frequency bands. Second, lightness compression and initial gamut mappin...
متن کاملColour Gamut Mapping as a Constrained Variational Problem
We present a novel, computationally efficient, iterative, spatial gamut mapping algorithm. The proposed algorithm offers a compromise between the colorimetrically optimal gamut clipping and the most successful spatial methods. This is achieved by the iterative nature of the method. At iteration level zero, the result is identical to gamut clipping. The more we iterate the more we approach an op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optics Express
سال: 2018
ISSN: 1094-4087
DOI: 10.1364/oe.26.011481